Composition Theorems for CCA Cryptographic Security

We present two new theorems to analyze the indistinguishability of the composition of cryptographic permutations and the indistinguishability of the XOR of cryptographic functions. Using the H Coefficients technique of [Pat01], for any two families of permutations F and G with CCA distinghuishability advantage ≤ αF and ≤ αG, we prove that the set of permutations f ◦ g, f ∈ F, g ∈ G has CCA distinguishability advantage ≤ αF × αG. This simple composition result gives a CCA indistinguishability geometric gain when composing blockciphers (unlike previously known clasical composition theorems). As an example, we apply this new theorem to analyze 4r and 6r rounds Feistel schemes with r ≥ 1 and we improve previous best known bounds for a certain range of queries. Similarly, for any two families of functions F and G with distinghuishability advantage ≤ αF and ≤ αG, we prove that the set of functions f ⊕ g, f ∈ F, g ∈ G has distinguishability advantage ≤ αF × αG. As an example, we apply this new theorem to analyze the XOR of 2r permutations and we improve the previous best known bounds for certain range of queries.